On Perfect Supercompilation
نویسندگان
چکیده
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that handles constraints on terms, thereby ensuring perfect information propagation. We illustrate this by transforming a näıvely specialised string matcher into an optimal one. The presented algorithm is guaranteed to terminate by means of generalisation steps.
منابع مشابه
Towards Higher-Level Supercompilation
We show that the power of supercompilation can be increased by constructing a hierarchy of supercompilers, in which a lowerlevel supercompiler is used by a higher-level one for proving improvement lemmas. The lemmas thus obtained are used to transform expressions labeling nodes in process trees, in order to avoid premature generalizations. Such kind of supercompilation, based on a combination o...
متن کاملAutomatic Verification of Counter Systems via Domain- Specific Multi-result Supercompilation Automatic Verification of Counter Systems via Domain-specific Multi-result Supercompilation. Keldysh Automatic Verification of Counter Systems via Domain-specific Multi-result Supercompilation Moscow 2012
matic verification of counter systems via domain-specific multi-result supercompilation We consider an application of supercompilation to the analysis of counter transition systems. Multi-result supercompilation enables us to find the best versions of the analysis by generating a set of possible results that are then filtered according to some criteria. Unfortunately, the search space may be ra...
متن کاملOvergraph Representation for Multi-Result Supercompilation (meta 2012)
In this paper we present a new approach to multi-result supercompilation based on joining together process graphs into a single graph and welding nodes corresponding to equal configurations. We show that this leads to a considerable reduction of nodes being built during supercompilation and enables more efficient configuration graph processing algorithms on the example of an enhanced residualiz...
متن کاملA Note on Program Specialization. What Can Syntactical Properties of Residual Programs Reveal?
The paper presents two examples of non-traditional using of program specialization by Turchin’s supercompilation method. In both cases we are interested in syntactical properties of residual programs produced by supercompilation. In the first example we apply supercompilation to a program encoding a word equation and as a result we obtain a program representing a graph describing the solution s...
متن کاملSupercompilation and the Reduceron
This paper explores some of the performance-enhancing features of supercompilation in the context of the Reduceron — a specialpurpose graph-reduction machine. Two small examples are discussed in detail, highlighting areas where the two technologies interact. A strategy is introduced for countering a situation where supercompilation adversely affects Reduceron execution time. Performance results...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999